Yet Another Graph Partitioning Problem is NP-Hard
نویسنده
چکیده
Recently a large number of graph separator problems have been proven to be NPHard. Amazingly we have found that α-Subgraph-Balanced-Vertex-Separator, an important variant, has been overlooked. In this work “Yet Another Graph Partitioning Problem is NP-Hard” we present the surprising result that α-SubgraphBalanced-Vertex-Separator is NP-Hard. This is despite the fact that the constraints of our new problem are harder to satisfy than the original problem.
منابع مشابه
A Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملGraph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملPartitioning VLSI circuits on the basis of Genetic Algorithms and Comparative Analysis Of KL And SA Partitioning Algorithms
Circuit partitioning is the one of the fundamental problems in VLSI design. It appears in several stages in VLSI design, such as logic design and physical design. Circuit partitioning is generally formulated as the graph partitioning problem. Circuit partitioning problem is a well known NP hard problem. The potential of Genetic Algorithm has been used to solve many computationally intensive pro...
متن کاملA Combinatorial View of the Graph Laplacians
Discussions about different graph Laplacians, mainly normalized and unnormalized versions of the graph Laplacians, have been ardent with respect to various methods in clustering and graph based semi-supervised learning. Previous research on the graph Laplacians investigated their convergence properties to Laplacian operators on continuous manifolds. There is still no strong proof on convergence...
متن کاملPartitioning Generic Graphs into K Balanced Subgraphs
Graph partitioning is a classical graph theory problem that has proven to be NP-hard. Most of the research in literature has focused its attention on a particular case of the problem called the graph bisection problem, where k = 2, such that the parts have approximately equal weight and minimizing the size of the edge cut. In this article, we describe how to obtain balanced partitioning on a gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.5544 شماره
صفحات -
تاریخ انتشار 2014